Some useful upper bounds for the selection of optimal profiles
نویسنده
چکیده
In enhanced oil recovery by chemical flooding within tertiary oil recovery, it is often necessary to choose optimal viscous profiles of the injected displacing fluids that reduce growth rates of hydrodynamic instabilities the most thereby substantially reducing the well-known fingering problem and improving oil recovery. Within the three-layer Hele–Shaw model, we show in this paper that selection of the optimal monotonic viscous profile of the middle-layer fluid based on well known theoretical upper bound formula [P. Daripa, G. Pasa, A simple derivation of an upper bound in the presence of a viscosity gradient in three-layer Hele–Shaw flows, Journal of Statistical Mechanics (2006) 11. http://dx.doi.org/10.1088/1742-5468/2006/01/P01014] agrees very well with that based on the computation of maximum growth rate of instabilities from solving the linearized stability problem. Thus, this paper proposes a very simple, fast method for selection of the optimal monotonic viscous profiles of the displacing fluids in multi-layer flows. © 2012 Elsevier B.V. All rights reserved.
منابع مشابه
Ranking of decision making units based on cross efficiency by undesirable outputs and uncertainity
Cross efficiency is one of the useful methods for ranking of decision making units (DMUs) in data envelopment analysis (DEA). Since the optimal solutions of inputs and outputs weights are not unique so the selection of them are not simple and the ranks of DMUs can be changed by the difference weights. Thus, in this paper, we introduce a method for ranking of DMUs which does not have a unique pr...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملDetermining the Optimal Value Bounds of the Objective Function in Interval Quadratic Programming Problem with Unrestricted Variables in Sign
In the most real-world applications, the parameters of the problem are not well understood. This is caused the problem data to be uncertain and indicated with intervals. Interval mathematical models include interval linear programming and interval nonlinear programming problems.A model of interval nonlinear programming problems for decision making based on uncertainty is interval quadratic prog...
متن کاملEstimating Upper and Lower Bounds For Industry Efficiency With Unknown Technology
With a brief review of the studies on the industry in Data Envelopment Analysis (DEA) framework, the present paper proposes inner and outer technologies when only some basic information is available about the technology. Furthermore, applying Linear Programming techniques, it also determines lower and upper bounds for directional distance function (DDF) measure, overall and allocative efficienc...
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کامل